Prof. Dr. Ulrich Kohlenbach Curriculum Vitae Ulrich Wilhelm Kohlenbach CURRENT AFFILIATION:

Source URL: www.mathematik.tu-darmstadt.de

• Formal sciences
• Metalogic
• Proof theory
• Philosophers of mathematics
• Mathematical logic
• Proof mining
• Logic
• Foundations of mathematics
• Workshop on Logic
• Language
• Information and Computation
• Mathematics
• Type theory
• Model theory

Topics in the Theory and Practice of Computable Analysis Branimir Lambov PhD Dissertation

Source URL: www.mathematik.tu-darmstadt.de

• Computability theory
• Theory of computation
• Computable number
• Computable analysis
• Mathematical analysis
• Mathematical logic
• Function
• Computable function
• Hypercomputation

Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics

Source URL: www.maths.lse.ac.uk

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP
• Matching
• P
• Time complexity
• Decision problem
• P versus NP problem
• 3-dimensional matching

Social Exchange Networks With Distant BargainingI Konstantinos Georgiou1 , George Karakostas2,∗, Jochen K¨onemann1 , Zuzanna Stamirowska3 Abstract Network bargaining is a natural extension of the classical, 2-player N

Source URL: www.cas.mcmaster.ca

• Computational complexity theory
• Game theory
• Theory of computation
• Computational problems
• Cooperative game theory
• Core
• NC
• Optimization problem

Computability Theory, Reverse Mathematics, and Ordered Fields Oscar Louis Levin, Ph.D. University of Connecticut, 2009

Source URL: www.math.uconn.edu

• Field theory
• Computability theory
• Real algebraic geometry
• Theory of computation
• Elementary mathematics
• Ordered field
• Computable function
• Field
• Archimedean property
• Function
• Real number
• Reverse mathematics

˝ DOMINATING THE ERDOS-MOSER THEOREM IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. The Erd˝

Source URL: ludovicpatey.com

• Mathematical analysis
• Mathematics
• Measure theory
• Computability theory
• Computable function
• Theory of computation
• Probability theory
• Differential forms
• Relationships among probability distributions
• Sigma-algebra

Papers in Computational Methods for D-modules Nobuki Takayama, This is a collection of papers in computational D-module theory. The scope is limited to computation of invariants of D-modules in

Source URL: www.math.kobe-u.ac.jp

BFT-B ENCH : F RAMEWORK TO E VALUATE R OBUSTNESS AND EFFECTIVENESS OF BFT P ROTOCOLS IN P RACTICE Divya Gupta, Lucas Perronne University of Grenoble, LIG, France Sara Bouchenak

Source URL: acmsocc.github.io

• Computing
• Fault-tolerant computer systems
• Engineering
• Byzantine fault tolerance
• Failure
• Fault tolerance
• Public-key cryptography
• Theory of computation
• Evaluation
• Fault injection
• Dependability
• Latency

A Hundred Impossibility Proofs for Distributed Computing Nancy A. Lynch * Lab for Computer Science MIT, Cambridge, MAlynchQtds.Ics.mit.edu

Source URL: groups.csail.mit.edu

• Fault-tolerant computer systems
• Mathematical logic
• Distributed computing
• Consensus
• Failure
• Theory of computation
• Proof of impossibility
• Algorithm
• Byzantine fault tolerance
• Parallel computing
• Shared register

Formal Verification of Hardware Synthesis Thomas Braibant1 and Adam Chlipala2 1 Inria

Source URL: plv.csail.mit.edu

• Programming idioms
• Computability theory
• Functional programming
• Logic in computer science
• Models of computation
• Recursion
• Denotational semantics
• Monad
• FO
• Valuation
• Static single assignment form